designing solvable graphs for multiple moving agents

solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent motion planning, called minimal solvable graphs is introduced. minimal solvable graphs are the smallest graphs among solvable graphs in terms of the number of vertices. also, for the first time, the problem of deciding whether a graph is solvable for m agents is answered, and a new algorithm is presented for making an existing graph solvable and lean for a given number of agents. finally, through an industrial example, it is demonstrated that how the findings of this paper can be used in designing and reshaping transportation networks (e.g. railways, traffic roads, agv routs, robotic workspaces, etc.) for multiple moving agents such as trains, vehicles, and robots.